Checking for Optimal Solutions in Some NP-Complete Problems
نویسندگان
چکیده
منابع مشابه
Checking for optimal solutions in some NP-complete problems.
For some weighted NP-complete problems, checking whether a proposed solution is optimal is a nontrivial task. Such is the case for the traveling salesman problem, or the spin-glass problem in three dimensions. In this Letter, we consider the weighted tripartite matching problem, a well known NP-complete problem. We write mean-field finite temperature equations for this model and derive their ze...
متن کاملThe Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that simultaneously examine the different possible paths. The other approach uses a preprocessing stage in which O(n) masks are constructed, each representing a different edge in the graph. The choice and combination of the...
متن کاملFaster Exact Solutions for Some NP-Hard Problems
This paper considers a number of NP-complete problems, and provides faster algorithms for solving them. The solutions are based on a recursive partitioning of the problem domain, and careful elimination of some of the branches along the search without actually checking them. The time complexity of the proposed algorithms is of the form O(2 ) for constant 0¡ ¡ 1, where n is the output size of th...
متن کاملComplete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملOn the Locality of Some NP-Complete Problems
We consider the distributed message-passing LOCAL model. In this model a communication network is represented by a graph where vertices host processors, and communication is performed over the edges. Computation proceeds in synchronous rounds. The running time of an algorithm is the number of rounds from the beginning until all vertices terminate. Local computation is free. An algorithm is call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2005
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.95.107202